Uniqueness Theorems for the Tricomi Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولUniqueness theorems for polyhedra.
In 1813, Cauchy2 gave the first proof of the theorem that two closed convex polyhedra in three-dimensional space are congruent if their faces are congruent in pairs and are joined to each other in the same order: in effect, the a priori possibility of rotations of the faces about the edges-which are obviously seen to be possible for some easily constructed open polyhedra-cannot occur for closed...
متن کاملUniqueness Theorems for Cauchy Integrals
If μ is a finite complex measure in the complex plane C we denote by C its Cauchy integral defined in the sense of principal value. The measure μ is called reflectionless if it is continuous (has no atoms) and C = 0 at μ-almost every point. We show that if μ is reflectionless and its Cauchy maximal function Cμ ∗ is summable with respect to |μ| then μ is trivial. An example of a reflectionless m...
متن کاملUniqueness Theorems for Rational Functions
In his book on the theory of meromorphic functions, R. Nevanlinna proved a number of "uniqueness theorems." The most important of them states that if two functions w=f(x) and w = g(x), meromorphic in the whole x-plane, assume five values of w (finite or infinite) at the same points x they must be identical. If we understand by the distribution of a function w = (x) with respect to a given va...
متن کاملUniqueness theorems for kernel methods
This paper has three goals: to find uniqueness theorems for some well-known kernel methods, and thereby to better understand their behavior; to derive theorems which apply to more general families of kernel methods; and to collect results which are hoped to be useful to workers who would like to prove uniqueness theorems for their own algorithms. Knowing when a solution is unique has the obviou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1953
ISSN: 0022-2518
DOI: 10.1512/iumj.1953.2.52005